Date: Tue, 10 Dec 1996 16:51:42 GMT
Server: NCSA/1.4.2
Content-type: text/html

<HTML>
<head>
<title>CSE 321 Assignment #7</title>
</head>
<body>
<h1>CSE 321 Assignment #7<br>Autumn 1996</h1>
<h3>Due: Wednesday, November 27, 1996.
<br>

</h3>
<p>
Reading Assignment: Read sections 6.1-6.4  of the text.
The following problems are from the Third Edition of the text.
 
<p> Problems: 
<ol>
<p><li> page 364, Problem 4.
<p><li> page 366, Problem 28 (a), (b).
<p><li> page 366, Problem 36.  (You may use without proof the fact that
the composition of relations is associative, i.e. (R o S) o T = R o (S o T)
for all relations R, S, and T on a set A.)
<p><li> page 380, Problem 10.  
<p><li> Write  a matrix representing the graph in problem 14.
<p><li> page 393, Problem 26 (c).  Show your work.
<p><li> page 393, Problem 28 (c).  Show your work.
<p><li> page 423, Problem 10.
<p><li> (Bonus) Page 423, Problem 15.
</ol>
</body>
</html>
